A Fast Block Low-Rank Dense Solver with Applications to Finite-Element Matrices
نویسندگان
چکیده
1. Abstract. This article presents a fast dense solver for hierarchically off-diagonal low-rank (HODLR) matrices. This solver uses algebraic techniques such as the adaptive cross approximation (ACA) algorithm to construct the low-rank approximation of the off-diagonal matrix blocks. This allows us to apply the solver to any dense matrix that has an off-diagonal low-rank structure without any prior knowledge of the problem. Using this solver, we propose an algorithm to lower the computational cost of the multifrontal sparse solve process for finite-element matrices arising out of 2D elliptic PDEs. This algorithm relies on the fact that dense “frontal” matrices that arise from the sparse elimination process can be efficiently represented as a hierarchically off-diagonal low-rank (HODLR) matrix. We also present an extended review of the literature on fast direct solvers for dense and sparse matrices.
منابع مشابه
A Fast and Memory Efficient Sparse Solver with Applications to Finite-Element Matrices
In this article we introduce a fast iterative solver for sparse matrices arising from the finite element discretization of elliptic PDEs. The solver uses a fast direct multi-frontal solver as a preconditioner to a simple fixed point iterative scheme. This approach combines the advantages of direct and iterative schemes to arrive at a fast, robust and accurate solver. We will show that this solv...
متن کاملFast Multipole Preconditioners for Sparse Matrices Arising from Elliptic Equations
Among optimal hierarchical algorithms for the computational solution of elliptic problems, the Fast Multipole Method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and relaxable global synchronization requirements. We demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel rep...
متن کاملHybrid cross approximation of integral operators
The efficient treatment of dense matrices arising, e.g., from the finite element discretisation of integral operators requires special compression techniques. In this article we use the H-matrix representation that approximates the dense stiffness matrix in admissible blocks (corresponding to subdomains where the underlying kernel function is smooth) by low-rank matrices. The low-rank matrices ...
متن کاملA Fast Solver for HSS Representations via Sparse Matrices
In this paper we present a fast direct solver for certain classes of dense structured linear systems that works by first converting the given dense system to a larger system of block sparse equations and then uses standard sparse direct solvers. The kind of matrix structures that we consider are induced by numerical low rank in the off-diagonal blocks of the matrix and are related to the struct...
متن کاملAn efficient multi-core implementation of a novel HSS-structured multifrontal solver using randomized sampling
We present a sparse linear system solver that is based on a multifrontal variant of Gaussian elimination, and exploits low-rank approximation of the resulting dense frontal matrices. We use hierarchically semiseparable (HSS) matrices, which have low-rank off-diagonal blocks, to approximate the frontal matrices. For HSS matrix construction, a randomized sampling algorithm is used together with i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Physics
دوره 304 شماره
صفحات -
تاریخ انتشار 2016